Connected components of complex divisor functions

Modular Divisor Functions and Quadratic Reciprocity

Some Asymptotic Formulas on Generalized Divisor Functions

1 . Throughout this paper, we use the following notation : c•1 , c2 , . . ., X0 , X1 , . . . denote positive absolute constants. We denote the number of elements of the finite set S by BSI . We write ex =exp (x) . We denote the least prime factor of n by p(n) . We write pall n if pain but pa+1 f n . v(n) denotes the number of the distinct prime factors of n, while the number of all the prime fa...

Twinless Strongly Connected Components

Tarjan [9], describes how depth first search can be used to identify Strongly Connected Components (SCC) of a directed graph in linear time. It is standard to study Tarjan’s SCC algorithm in most senior undergraduate or introductory graduate computer science algorithms courses. In this paper we introduce the concept of a twinless strongly connected component (TSCC) of a directed graph. Loosely ...

Quasi-4-Connected Components

We introduce a new decomposition of a graphs into quasi-4-connected components, where we call a graph quasi-4-connected if it is 3-connected and it only has separations of order 3 that separate a single vertex from the rest of the graph. Moreover, we give a cubic time algorithm computing the decomposition of a given graph. Our decomposition into quasi-4-connected components refines the well-kno...

DIVISOR FUNCTIONS AND WEIERSTRASS FUNCTIONS ARISING FROM q-SERIES

We consider Weierstrass functions and divisor functions arising from q-series. Using these we can obtain new identities for divisor functions. Farkas [3] provided a relation between the sums of divisors satisfying congruence conditions and the sums of numbers of divisors satisfying congruence conditions. In the proof he took logarithmic derivative to theta functions and used the heat equation. ...